Abelian complexity and abelian co-decomposition
نویسندگان
چکیده
منابع مشابه
Avoiding Abelian Powers in Binary Words with Bounded Abelian Complexity
The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waerden’s theorem, they proved that if a word avoids Abelian k-powers for some integer k, then its Abelian complexity is unbounded. This suggests the following question: How frequently do Abelian k-powers occur in a word ...
متن کاملSpace complexity of Abelian groups
We develop a theory of LOGSPACE structures and apply it to construct a number of examples of Abelian Groups which have LOGSPACE presentations. We show that all computable torsion Abelian groups have LOGSPACE presentations and we show that the groups Z, Z(p∞), and the additive group of the rationals have LOGSPACE presentations over a standard universe such as the tally representation and the bin...
متن کاملDecomposition of Elements in Abelian Groups*
In the present paper we determine necessary and sufficient conditions for an abelian group to have the property Pw . The author first proved the validity of these conditions for fields, but, as noted by T. Nakayama, the operation X does not occur, so that the theory may be stated for a system of elements with only one operation + defined for these elements. Groups with the property Pn have usef...
متن کاملGeneral solution of the non-abelian Gauss law and non-abelian analogs of the Hodge decomposition
General solution of the non-abelian Gauss law in terms of covariant curls and gradients is presented. Also two non-abelian analogs of the Hodge decomposition in three dimensions are addressed. i) Decomposition of an isotriplet vector field V a i (x) as sum of covariant curl and gradient with respect to an arbitrary background Yang-Mills potential is obtained. ii) A decomposition of the form V a...
متن کاملAbelian complexity function of the Tribonacci word
According to a result of Richomme, Saari and Zamboni, the abelian complexity of the Tribonacci word satisfies ρab(n) ∈ {3, 4, 5, 6, 7} for each n ∈ N. In this paper we derive an automaton that evaluates the function ρab(n) explicitly. The automaton takes the Tribonacci representation of n as its input; therefore, (ρ(n))n∈N is an automatic sequence in a generalized sense. Since our evaluation of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2013
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2012.10.034